Computing Submesh Reliability in Two-Dimensional Meshes

نویسندگان

  • Chung-yen Chang
  • Prasant Mohapatra
چکیده

An analytical model for computing submesh reliability is proposed in this paper. The system is considered operational as long as a functional submesh of the required size is available. We use the principle of inclusion and exclusion to find the exact probability of having a functional submesh within a partition of the mesh. The reliability of a partition is then used to approximate the submesh reliability of the system and thus this model is called partitioned mesh (PM) model. The partitions are taken along either dimension of the mesh. The selection of the dimension on which the partitions are made is based on the required submesh size. It is shown that the submesh reliability in every partition reduces to a polynomial with only two terms. The partitioned mesh model is validated with simulation and compared with the earlier proposed approximation techniques. It is shown that the PM model provides better approximations for submesh reliability with constant computational complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Dependability Evaluation of Mesh Connected Multiprocessors*

Analytical techniques for reliability and availability prediction of mesh connected systems are proposed in this paper. The models are based on the submesh requirements. First, a reliability model is proposed assuming that a submesh can be always recognized if it exits. Analysis of the linear consecutive n-out-of-N system is extended using an expanding row/column technique to evaluate the subme...

متن کامل

On Task Relocation in Two-Dimensional Meshes

In parallel computer systems with a number of processors, external fragmentation is caused by continuous allocation and deallocation of processors to tasks which require exclusive use of several contiguous processors. With this condition, the system may not be able to find contiguous processors to be allocated to an incoming task even with a sufficient number of free processors. Relocation is a...

متن کامل

An E cient Processor Allocation Scheme for Mesh ConnectedParallel

Several processor allocation schemes are proposed in the literature for mesh connected parallel computers. All these schemes aim at improving the system performance by reducing internal fragmentation or by enhancing the submesh recognition ability. In this paper , we propose an approach of system partitioning to reduce external fragmentation and thereby improve the system performance. The targe...

متن کامل

On-line scheduling mesh jobs with dependencies

We study an on-line problem of scheduling parallel jobs on two-dimensional meshes. Parallel jobs arrive dynamically according to the dependencies between them, which are unknown before the jobs appear. Each job may need more than one processor simultaneously and is required to be scheduled on a submesh of the processors which are located on a two-dimensional mesh, i.e., a job must be scheduled ...

متن کامل

Dynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks∗

Among several multiprocessor topologies, twodimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for realtime environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time ta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007